The Markgraf Karl Refutation Procedure
نویسندگان
چکیده
The goal of the MKRP project is the development of a theorem prover which can be used as an inference engine in various applications, in particular it should be capable of proving significant mathematical theorems. Our first implementation, the Markgraf Karl Refutation Procedure1 (MKRP) realizes some of the ideas we have developed to this end. It is a general purpose resolution based deduction system that exploits the representation of formulae as a graph (clause graph). The main features are its well tailored selection components, heuristics and control mechanisms for guiding the search for a proof. This paper gives an overview of the system. It summarizes and evaluates our experience with the system in particular, and the logics we use as well as the clause graph approach: as 1990 marks the fifteenth birthday of the system, the time may have come to ask: “Was it worth the effort?”
منابع مشابه
Terminator
The Markgraf Karl Refutation Procedure (MKR-Procedure) is an automated theorem prover for sorted logic, based on an extended clause graph calculus, currently under development at the University of Karlsruhe. This paper describes the TERMINATOR module, a component of the MKR-Procedure, which is essentially a very fast algorithm for the search for unit refuta-tions. The TERMINATOR is used as a fa...
متن کاملRefutation of random constraint satisfaction problems using the sum of squares proof system
Given a k-ary predicate P, a random instance of a constraint satisfaction problem with predicate P (CSP(P)) is a set of m constraints on n variables. Each constraint is P applied to k random literals. Such an instance is unsatisfiable with high probability when m >> n. Refutation is certifying that a given randomly chosen instance is unsatisfiable. This task has applications in cryptography, ha...
متن کاملIntegrity Constraints as Views in DeductiveDatabases
In this paper we present a refutation procedure to compute goals in a deductive database according to particular views of it. Views are deened by a set of constraints rules. The declarative semantics of the constrained database is deened and the given refutation procedure is proved correct and complete for positive range{restricted databases. The extension of the procedure to deal with negation...
متن کاملA Transformational Approach to Negation in Logic Programming
D A transformation technique is introduced which, given the Horn-clause definitions of a set of predicates p,, synthesizes the definitions of new predicates pi which can be used, under a suitable refutation procedure, to compute the finite failure set of pi. This technique exhibits some computational advantages, such as the possibility of computing nonground negative goals still preserving the ...
متن کامل